Evolution of Symbolic Grammar Systems

نویسندگان

  • Takashi Hashimoto
  • Takashi Ikegami
چکیده

Evolution of symbolic language and grammar is studied in a network model. Language is expressed by words, i.e. strings of symbols, which are generated by agents with their own symbolic grammar system. By deriving and accepting words, the agents communicate with each other. An agent which can derive less frequent and less acceptable words and accept words in less computational time will have higher scores. Grammars of agents can evolve by mutationally processes, where higher scored agents have more chances to breed their o springs with improved grammar system. Complexity and diversity of words increase in time. It is found that the module type evolution and the emergence of loop structure enhance the evolution. Furthermore, ensemble structure (net-grammar) emerges from interaction among individual grammar systems. A net-grammar restricts structures of individual grammar and determines their evolutionary pathway.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Emergence of net-grammar in communicating agents.

Evolution of symbolic language and grammar is studied in a network model. Language is expressed by words, i.e. strings of symbols, which are generated by agents with their own symbolic grammar system. Agents communicate with each other by deriving and accepting words via rewriting rule set. They are ranked according to their communicative effectiveness: an agent which can derive less frequent a...

متن کامل

Pre-, In- and Postfix grammars for Symbolic Regression in Grammatical Evolution

Recent research has indicated that grammar design is an important consideration when using grammar-based Genetic Programming, particularly with respect to unintended biases that may arise through rule ordering or duplication. In this study we examine how the ordering of the elements during mapping can impact performance. Here we use to the standard GE depth-first mapper and compare the performa...

متن کامل

Grammatical Evolution: A Steady State approach

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern the mapping of a Backus Naur Form grammar definition to a program, expressions and programs of arbitrary complexity may be evolved. Our system, Grammatical Evolution, has been applied to problems such as a Symbolic Regression problem, and finding Trigonometric Identities. In this p...

متن کامل

Systems Biology Modeling in Human Genetics Using Petri Nets and Grammatical Evolution

Understanding the hierarchical relationships among biochemical, metabolic, and physiological systems in the mapping between genotype and phenotype is expected to improve the diagnosis, prevention, and treatment of common, complex human diseases. We previously developed a systems biology approach based on Petri nets for carrying out thought experiments for the generation of hypotheses about biol...

متن کامل

Phenotype Diversity Objectives for Graph Grammar Evolution

Evolutionary algorithms are a practical means of optimising the topology of graphs. This paper explores the use of phenotype diversity measures as objectives in a graph grammar-based model of multi-objective graph evolution. Since the initial population in this model is exclusively constituted by empty productions, an active promotion of diversity is needed to establish the necessary building b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995